package leetcode.study.tree;


import common.NxTreeNode;

import java.util.List;

/**
 * N叉树的前序遍历
 */
public class NxTreeNodeHeadRange {
    public List<Integer> preorder(NxTreeNode root) {
        if (root == null){
            return null;
        }
        for (NxTreeNode child : root.children) {
            System.out.println(child.val);
            preorder(child);
        }
        return null;
    }
}
